#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    if(n==2){
        cout<<0<<"\n";
        continue;
    }
    if(n%2==0){
        for(LL i=1;i<=n;i++){
            if(i&1){
                for(LL j=1;j<=n-i;j++){
                    if( (i&1)&&j==1 ) cout<<"0"<<" ";
                    else if(j%2==0) cout<<"-1"<<" ";
                    else cout<<"1"<<" ";
                }
            }
            else if(i%2==0){
                for(LL j=1;j<=n-i;j++){
                    if(j&1) cout<<"1"<<" ";
                    else cout<<"-1"<<" ";
                }
            }
           /// cout<<"\n";
        }
        cout<<"\n";
    }
    else if(n&1){
        for(LL i=1;i<=n;i++){
            for(LL j=1;j<=n-i;j++){
                if(j&1) cout<<"1"<<" ";
                else cout<<"-1"<<" ";
            }
        }
        cout<<"\n";
    }
  }
return 0;
}
